Transient Analysis of the Bmap/ph/1 Queue
نویسنده
چکیده
We derive in this paper the transient queue length and the busy period distributions of a single server queue with phase-type (PH) service times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precision of the result can be given in advance.
منابع مشابه
Transient queue length and busy period of the BMAP / PH / 1 queue
We derive in this paper the transient queue length and the busy period distributions in the single server queue with phase-type (PH) services times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precisio...
متن کاملThe BMAP/G/1 QUEUE: A Tutorial
We present an overview of recent results related to the single server queue with general independent and identically distributed service times and a batch Markovian arrival process (BMAP). The BMAP encompasses a wide range of arrival processes and yet, mathematically, the BMAP/G/I model is a relatively simple matrix generalization of the M/G/l queue. Stationary and transient distributions for t...
متن کاملFurther Transient Analysis of the BMAP/G/1 Queue
Previously, we derived the two-dimensional transforms of the emptiness function, the transient workload and queue-length distributions in the single-server queue with general service times and a batch Markovian arrival process (BMAP). This arrival process includes the familiar phase-type renewal process and the Markov modulated Poisson process as special cases, as well as superpositions of thes...
متن کاملThe Transient Bmap / G /1 Queue
We derive the two-dimensional transforms of the transient workload and queue-length distributions in the single-server queue with general service times and a batch Markovian arrival process (BMAP). This arrival process includes the familiar phase-type renewal process and the Markov modulated Poisson process as special cases, and allows correlated interarrival times and batch sizes. Numerical re...
متن کاملErgodicity of the BMAP/PH}/s/s+K retrial queue with PH-retrial times
Abstract Define the traffic intensity as the ratio of the arrival rate to the service rate. This paper shows that the BMAP/PH/s/s+K retrial queue with PH-retrial times is ergodic if and only if its traffic intensity is less than one. The result implies that the BMAP/PH/s/s+K retrial queue with PH-retrial times and the corresponding BMAP/PH/s queue have the same condition for ergodicity, a fact ...
متن کامل